Successive galerkin approximation of the isaacs equation
نویسندگان
چکیده
منابع مشابه
Successive Galerkin Approximation of the Isaacsequation
The successive Galerkin approximation (SGA) algorithm has recently been developed for approximating solutions to the Hamilton-Jacobi-Isaacs equation. The algorithm produces feedback control laws that are stabilizing on a well-deened region of state space. The objective of this paper is to demonstrate the application of the SGA algorithm to two simple examples. The examples serve several purpose...
متن کاملSuccessive Galerkin Approximation of Nonlinear Optimal Attitude Control
This paper presents the application of the Successive Galerkin Approximation (SGA) to the Hamilton-Jacobi-Bellman equation to obtain solutions of the optimal attitude control problem. Galerkin's method approximates the value function by a truncated Galerkin series expansion. To do so a truncated Galerkin basis set is formed. A suucient number of functions must be included in this Galerkin basis...
متن کاملNonlinear Robust Missile Autopilot Design Using Successive Galerkin Approximation
The application of a new nonlinear robust control strategy to the design of missile autopilots is presented. The control approach described and demonstrated here is based upon the numerical solution of the Hamilton-Jacobi-Isaacs equation by Successive Galerkin Approximation. Using this approach, feedback controllers are computed by an iterative application of a numerical Galerkin-type PDE solve...
متن کاملGalerkin Approximation of the Generalized Hamilton-jacobi Equation
If u is a stabilizing control for a nonlinear system that is aane in the control variable, then the solution to the Generalized Hamilton-Jacobi-Bellman (GHJB) equation associated with u is a Lyapunov function for the system and equals the cost associated with u. If an explicit solution to the GHJB equation can be found then it can be used to construct a feedback control law that improves the pe...
متن کاملParallel Algorithms for the Isaacs Equation
In this paper we apply a domain decomposition technique to construct an approximation scheme for the Isaacs equation in R n. The algorithm is presented for a 2-domain decomposition and some hints are given for the case of d subdomains having crossing points. The parallel algorithm is proved to have the same xed point of the serial algorithm so that the convergence to the viscosity solution of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 1999
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)56351-x